Solvability and Algorithms for Functional Equations Originating from Dynamic Programming

The main purpose of this paper is to study the functional equation arising in dynamic programming of multistage decision processes f x opty∈Dopt{p x, y , q x, y f a x, y , r x, y f b x, y , s x, y f c x, y } for all x ∈ S. A few iterative algorithms for solving the functional equation are suggested. The existence, uniqueness and iterative approximations of solutions for the functional equation are discussed in the Banach spaces BC S and B S and the complete metric space BB S , respectively. The properties of solutions, nonnegative solutions, and nonpositive solutions and the convergence of iterative algorithms for the functional equation and other functional equations, which are special cases of the above functional equation, are investigated in the complete metric space BB S , respectively. Eight nontrivial examples which dwell upon the importance of the results in this paper are also given.